Iterated relabeling tree transducers
نویسندگان
چکیده
In this paper we consider the closure UCI(Rel) of the class of relabeling tree transformations, under U=union, C=composition and I=iteration. We give a characterization of UCI(Rel) in terms of a short expression built up from Rel with composition and iteration. We also give a characterization of UCI(Rel) in terms of one-step rewrite relations of very simple term rewrite systems. We give a similar characterization of UC(FRel+) where FRel+ is the class consisting of the transitive closures of all functional relabeling tree transformations. Finally we show that UCI(Rel) = UCI(FRel).
منابع مشابه
Properties of Quasi-Relabeling Tree Bimorphisms
The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is de ned by a tree bimorphism (φ,L, ψ), where φ and ψ are quasi-relabeling tree homomorphisms and L is a regular tree language. Such relations admit a canonical representation, which immediately also yields that QUASI is closed under nite union. Howe...
متن کاملBottom-Up and Top-Down Tree Series Transformations
We generalize bottom-up tree transducers and top-down tree transducers to the concept of bottom-up tree series transducer and top-down tree series transducer, respectively, by allowing formal tree series as output rather than trees, where a formal tree series is a mapping from output trees to some semiring. We associate two semantics with a tree series transducer: a mapping which transforms tre...
متن کاملPushdown Machines for the Macro Tree Transducer
The macro tree transducer can be considered as a system of recursive function procedures with parameters, where the recursion is on a tree (e.g., the syntax tree of a program). We investigate characterizations of the class of tree (tree-to-string) translations which is induced by macro tree transducers (macro tree-to-string transducers, respectively). For this purpose we define several pushdown...
متن کاملExtrapolating Tree Transformations
We consider the framework of regular tree model checking where sets of configurations of a system are represented by regular tree languages and its dynamics is modeled by a term rewriting system (or a regular tree transducer). We focus on the computation of the reachability set R(L) where R is a regular tree transducer and L is a regular tree language. The construction of this set is not possib...
متن کاملRational tree relations
We investigate forests and relations on trees generated by grammars in which the non-terminals represent relations. This introduces some synchronization between productions. We show that these sets are also solutions of systems of equations, that they are described by rational expressions involving union, substitution and iterated substitution, and that they are preserved by residuals. We show ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 276 شماره
صفحات -
تاریخ انتشار 2002